Euclidean automata

نویسنده

  • Andras Kornai
چکیده

In this note we introduce Euclidean automata (EA), a simple generalization of Finite State Automata (FSA). EA operate not on symbols from a finite alphabet as usual, but rather on vectors from a parameter space P , typically R. The main motivation for EA comes from classification problems involving a forced choice between a finite number (in the most important case, only two) alternatives. Since we want classifications to be stable under small perturbation of inputs, ideally the set of points in P classified to a given value should be open, yet it is evident that we cannot partition R or C into finitely many disjoint open sets. Approximate solutions thus must give up non-overlapping, e.g. by permitting probabilistic or fuzzy outcomes, or exhaustiveness, e.g. by leaving ‘gray areas’ near decision boundaries where the system produces no output. EA, as we shall see, sacrifice non-overlapping but maintain sharp, deterministic decision boundaries. Using EA we offer the beginnings of an analysis of being in a conflicted state, some situation where we know that we should do A, since it is ‘the right thing to do’ yet we have a strong compulsion to do some B (including doing nothing) instead. To anchor the discussion we will use several specific examples, such as refraining from or taking some drug such as tobacco, alcohol, or heroin, that is generally agreed to have pleasant short-term but harmful long-term effects; slipping into some recreational activity while there is still work to do; keeping or not keeping some promise; etc. The problem is complex, arguably it is the single most complex problem we have to face in everyday life. Therefore, some simplification will be necessary, and we will state the main problem in a way that already abstracts away from certain aspects that would take us far from our goal of analyzing internal conflict. First, we are not interested in defending the specific moral premisses used in the analysis of drug addiction, laziness, and similar examples of conflict: our focus is with the conflicted state itself, not the individual components. Second, we will pay only limited attention of the issue of how we know that A is the right thing rather than some alternative A′ or even B – we are interested in the situation when we already know that A is right and B is wrong. Third, real life conflicts are rarely between two, laboratory pure components: often there are multiple factors,

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite automata with continuous input

Euclidean Automata (EA) are finite state computational devices that take continuous parameter vectors as input. We investigate decompositions of EA into simpler Euclidean and classical finite state automata, relate them to better known computational devices such as artificial neural nets and electronic devices, and show that they are plausible Big Mechanism candidates.

متن کامل

Cellular Automata in Non-Euclidean Spaces

Classical results on the surjectivity and injectivity of parallel maps are shown to be extendible to the cases with non-Euclidean cell spaces of particular types. Also shown are obstructions to extendibility, which may shed light on the nature of classical results such as the Garden-of-Eden theorem. Key–Words: Cellular automata, Non Euclidean cell spaces, the Garden-of-Eden theorem

متن کامل

Data Structures for the Veri cation of Timed Automata

In this paper we suggest numerical decision diagrams a bdd based data structure for representing certain subsets of the Euclidean space namely those encountered in veri cation of timed automata Un like other representation schemes ndd s are canonical and provide for all the necessary operations needed in the veri cation and synthesis of timed automata We report some preliminary experimental res...

متن کامل

Data-Structures for the Verification of Timed Automata

In this paper we suggest numerical decision diagrams, a bdd-based data-structure for representing certain subsets of the Euclidean space, namely those encountered in veriication of timed automata. Unlike other representation schemes, ndd's are canonical and provide for all the necessary operations needed in the veriication and synthesis of timed automata. We report some preliminary experimental...

متن کامل

Hybrid Automata with Finite Bisimulatioins

The analysis, veri cation, and control of hybrid automata with nite bisimulations can be reduced to nite-state problems. We advocate a time-abstract, phasebased methodology for checking if a given hybrid automaton has a nite bisimulation. First, we factor the automaton into two components, a boolean automaton with a discrete dynamics on the nite state space B and a euclidean automaton with a co...

متن کامل

A Mapping Function to Use Cellular Automata for Solving MAS Problems

Cellular automata are a very powerful and well researched area in computer science. We use approaches from the cellular automata research to solve optimization problems in the multi agent system research area. For this purpose, we require a transformation from agents located in an Euclidean space into an abstract cell assignment for cellular automata. In this paper, a mapping function is presen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014